منابع مشابه
Disappearing women, vanishing ladies and property in embryos
Jenni Millbank’s incisive article, ‘Reflecting the “human nature” of IVF embryos: disappearing women in ethics, law and fertility practice’,1 takes issue with the prevailing concentration on ‘respect for the embryo’ in guidelines and statutes concerning embryo storage. She argues that there is insufficient regard for the specific significance of embryos to the womenwho underwent complex and dif...
متن کاملOn set systems with a threshold property
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k − 1)-subset of [n] contains less than t sets from F . The minimal number of sets in a set system with this property is denoted by m(n, k, t). In this paper we determine m(n, 4, 3) exactly for n sufficiently large, and we show th...
متن کاملSet covering with almost consecutive ones property
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...
متن کاملDescent of Semidualizing Complexes for Rings with the Approximation Property
Let R be a commutative noetherian local ring with completion b R. When R has the approximation property, we prove an approximation result for complexes with finitely generated homology. This is used to investigate descent of semidualizing complexes from b R to R. We show that, if R has the approximation property, then there is a bijective correspondence between semidualizing b R-complexes and s...
متن کاملA Priority Queue with the Working-set Property
A new priority queue is introduced, for which the cost to insert a new item is constant and the cost to delete the item x with the minimum value is O(log kx), where kx is the number of items that are inserted after x and are still in the heap when x is deleted. We achieve the above bounds in both the amortized case and the worst case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1972
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1972-0309118-8